FO is Nice
نویسنده
چکیده
This paper deals with two fragments of first-order logic, viz., fluted logic and two-variable logic. These fragments are known to have many properties in common, among them the finite model property and NEXPTIME-completeness for satisfiability. It is shown here that they also have in common the interpolation property and the submodel preservation property.
منابع مشابه
Aperiodic String Transducers
Regular string-to-string functions enjoy a nice triple characterization through deterministic two-way transducers (2DFT), streaming string transducers (SST) and MSO definable functions. This result has recently been lifted to FO definable functions, with equivalent representations by means of aperiodic 2DFT and aperiodic 1-bounded SST, extending a well-known result on regular languages. In this...
متن کاملAdjustment and Growth: Macroeconomic Performance of the IMF and World Bank Integrated model for Selected Mediterranean and MENA Developing Countries
accentuate on the programs advocated by the IMF and the World Bank from the model known as the "Integrated Model IMF-World Bank". This research makes a comprehensive evaluation of the applicability of this model to analyze the performance of adjustment programs in the case of six countries in the Mediterranean and Middle East and North Africa (MENA) region, namely, Algeria, Egypt, Iran, Morocco...
متن کاملForcing notions in inner models
There is a partial order P preserving stationary subsets of !1 and forcing that every partial order in the ground model V that collapses a su ciently large ordinal to !1 over V also collapses !1 over V P. The proof of this uses a coding of reals into ordinals by proper forcing discovered by Justin Moore and a symmetric extension of the universe in which the Axiom of Choice fails. Also, using on...
متن کاملModel Checking and Satisfiability for Sabotage Modal Logic
We consider the sabotage modal logic SML which was suggested by van Benthem. SML is the modal logic equipped with a ‘transition-deleting’ modality and hence a modal logic over changing models. It was shown that the problem of uniform model checking for this logic is PSPACE-complete. In this paper we show that, on the other hand, the formula complexity and the program complexity are linear, resp...
متن کاملDyck-based characterizations of Indexed Languages
Indexed languages are languages recognized by pushdown automata of level 2 and by indexed grammars. We propose here some new characterizations linking indexed languages to context-free languages: the class of indexed languages is the image of the Dyck language by a nice class of context-free transducers, it is also the class of images, by a projection defined by an FO-formula of nested words la...
متن کامل